New separation between $s(f)$ and $bs(f)$
نویسندگان
چکیده
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: bs(f) = 2 3 s(f) − 1 3 s(f).
منابع مشابه
New separation between s ( f ) and bs ( f ) Andris
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: bs(f) = 23s(f) 2 − 13s(f).
متن کاملSensitivity versus block sensitivity of Boolean functions
Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1 2 s(f) 2 + 1 2 s(f). The best known separation previously was bs(f) = 1 2 s(f) 2 due to Rubinstein. We also report results of computer search for functions with at most 12 variables.
متن کاملOn the Sensitivity Conjecture
The sensitivity of a Boolean function f : {0, 1} → {0, 1} is the maximal number of neighbors a point in the Boolean hypercube has with different f -value. Roughly speaking, the block sensitivity allows to flip a set of bits (called a block) rather than just one bit, in order to change the value of f . The sensitivity conjecture, posed by Nisan and Szegedy (CC, 1994), states that the block sensi...
متن کاملLattice Variant of the Sensitivity Conjecture
The Sensitivity Conjecture, posed in 1994, states that the fundamental measures known as the sensitivity and block sensitivity of a Boolean function f , s(f) and bs(f) respectively, are polynomially related. It is known that bs(f) is polynomially related to important measures in computer science including the decision-tree depth, polynomial degree, and parallel RAM computation time of f , but l...
متن کاملLow-Sensitivity Functions from Unambiguous Certificates
We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power 2.1 separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 18 شماره
صفحات -
تاریخ انتشار 2011